منابع مشابه
Optimizing persistent random searches.
We consider a minimal model of persistent random searcher with a short range memory. We calculate exactly for such a searcher the mean first-passage time to a target in a bounded domain and find that it admits a nontrivial minimum as function of the persistence length. This reveals an optimal search strategy which differs markedly from the simple ballistic motion obtained in the case of Poisson...
متن کاملStatistical Physics of Random Searches
We apply the theory of random walks to quantitatively describe the general problem of how to search eÆciently for randomly located objects that can only be detected in the limited vicinity of a searcher who typically has a nite degree of \free will" to move and search at will. We illustrate L evy ight search processes by comparison to Brownian random walks and discuss experimental observations ...
متن کاملLévy flights and random searches
In this work we discuss some recent contributions to the random search problem. Our analysis includes superdiffusive Lévy processes and correlated random walks in several regimes of target site density, mobility and revisitability. We present results in the context of mean-field-like and closed-form average calculations, as well as numerical simulations. We then consider random searches perform...
متن کاملevy ight random searches in biological phenomena
There has been growing interest in the study of L evy ights observed in the movements of biological organisms performing random walks while searching for other organisms. Here, we approach the problem of what is the best statistical strategy for optimizing the encounter rate between “searcher” and “target” organisms—either of the same or of di9erent species—in terms of a limiting generalized se...
متن کاملFIRE/J - optimizing regular expression searches with generative programming
Regular expressions are a powerful tool for analyzing and manipulating text. Their theoretical background lies within automata theory and formal languages. The FIRE/J (Fast Implementation of Regular Expressions for Java) regular expression library is designed to provide maximum execution speed, while remaining portable across different machine architectures. To achieve that, FIRE/J transforms e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2012
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.108.088103